Disjoint Hamiltonian Cycles in Recursive Circulant Graphs
نویسنده
چکیده
We show in this paper that the circulant graph G( 2”‘, 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @ 1997 Published by Elsevier Science B.V.
منابع مشابه
An Improved Construction Method for MIHCs on Cycle Composition Networks
Many well-known interconnection networks, such as kary n-cubes, recursive circulant graphs, generalized recursive circulant graphs, circulant graphs and so on, are shown to belong to the family of cycle composition networks. Recently, various studies about mutually independent hamiltonian cycles, abbreviated as MIHC’s, on interconnection networks are published. In this paper, using an improved ...
متن کاملPermanents of Circulants: a Transfer Matrix Approach (expanded Version) *
Calculating the permanent of a (0, 1) matrix is a #P -complete problem but there are some classes of structuredmatrices for which the permanent is calculable in polynomial time. The most well-known example is the fixedjump (0, 1) circulant matrix which, using algebraic techniques, was shown by Minc to satisfy a constant-coefficient fixed-order recurrence relation. In this note we show how, by i...
متن کاملA recursively construction scheme for super fault-tolerant hamiltonian graphs
For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k ...
متن کاملCounting Spanning Trees and Other Structures in Non-constant-jump Circulant Graphs
Circulant graphs are an extremely well-studied subclass of regular graphs, partially because they model many practical computer network topologies. It has long been known that the number of spanning trees in n-node circulant graphs with constant jumps satisfies a recurrence relation in n. For the non-constant-jump case, i.e., where some jump sizes can be functions of the graph size, only a few ...
متن کاملPancyclicity of recursive circulant graphs
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic. 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 61 شماره
صفحات -
تاریخ انتشار 1997